The SCM FSA Computer

(2) Let N be a non empty set with non empty elements, and let S be a definite AMI over N , and let s be a state of S, and let i be an instructionlocation of S. Then s(i) is an instruction of S. (3) Let N be a non empty set with non empty elements, and let S be an AMI over N , and let s be a state of S. Then the instruction locations of S ⊆ dom s. (4) Let N be a non empty set with non empty elements, and let S be a von Neumann AMI over N , and let s be a state of S. Then ICs ∈ dom s. (5) Let N be a non empty set with non empty elements, and let S be an AMI over N , and let s be a state of S, and let l be an instruction-location of S. Then l ∈ dom s.